A new elementary algorithm for proving q-hypergeometric identities
نویسنده
چکیده
We give a fast elementary algorithm to get a small number n1 for an admissible q-properhypergeometric identity ∑ k F(n, k) = G(n), n ≥ n0 such that we can prove the identity by checking its correctness for n (n0 ≤ n ≤ n1). For example, we get n1 = 191 for the q-Vandermonde-Chu identity, n1 = 70 for a finite version of Jacobi’s triple product identity and n1 = 209 for an identity due to L.J. Rogers. c © 2003 Published by Elsevier Science Ltd.
منابع مشابه
An algorithmic proof theory for hypergeometric (ordinary and <Emphasis Type="Italic">q </Emphasis>) multisum/integral identities
It is shown that every 'proper-hypergeometric ' multisum/integral identity, or q-identity, with a fixed number of summations and/or integration signs, possesses a short, computer-constructible proof. We give a fast algorithm for finding such proofs. Most of the identities that involve the classical special functions of mathematical physics are readily reducible to the kind of identities treated...
متن کاملNonterminating Basic Hypergeometric Series and the q-Zeilberger Algorithm
We present a systematic method for proving nonterminating basic hypergeometric identities. Assume that k is the summation index. By setting a parameter x to xqn, we may find a recurrence relation of the summation by using the q-Zeilberger algorithm. This method applies to almost all nonterminating basic hypergeometric summation formulas in the book of Gasper and Rahman. Furthermore, by comparin...
متن کاملABEL’S METHOD ON SUMMATION BY PARTS AND BALANCED q-SERIES IDENTITIES
The Abel method on summation by parts is reformulated to present new and elementary proofs of several classical identities of terminating balanced basic hypergeometric series. The examples strengthen our conviction that as traditional analytical instrument, the revised Abel method on summation by parts is indeed a very natural choice for working with basic hypergeometric series.
متن کاملElliptic Hypergeometric Series on Root Systems
We derive a number of summation and transformation formulas for elliptic hypergeometric series on the root systems An, Cn and Dn. In the special cases of classical and q-series, our approach leads to new elementary proofs of the corresponding identities.
متن کاملFINE-TUNING ZEILBERGER’S ALGORITHM The Methods of Automatic Filtering and Creative Substituting
It is shown how the performance of Zeilberger’s algorithm and its q-version for proving (q-)hypergeometric summation identities can be dramatically improved by a frequently missed optimization on the programming level and by applying certain kinds of substitutions to the summand. These methods lead to computer proofs of identities for which all existing programs have failed so far.
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید
ثبت ناماگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید
ورودعنوان ژورنال:
- J. Symb. Comput.
دوره 35 شماره
صفحات -
تاریخ انتشار 2003